On Two Conjectures about Permutation Trinomials over $\mathbb{F}_{3^{2k}}$

نویسنده

  • Nian Li
چکیده

Permutation polynomials with few terms attracts researchers’ interest in recent years due to their simple algebraic form and some additional extraordinary properties. In this paper, by analyzing the quadratic factors of a fifth-degree polynomial and a seventh-degree polynomial over the finite field F32k , two conjectures on permutation trinomials over F32k proposed recently by Li, Qu, Li and Fu are settled, where k is a positive integer.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

More new classes of permutation trinomials over $\mathbb{F}_{2^n}$

Permutation polynomials over finite fields have wide applications in many areas of science and engineering. In this paper, we present six new classes of permutation trinomials over F2n which have explicit forms by determining the solutions of some equations.

متن کامل

Several Classes of Permutation Trinomials over $\mathbb F_{5^n}$ From Niho Exponents

The construction of permutation trinomials over finite fields attracts people’s interest recently due to their simple form and some additional properties. Motivated by some results on the construction of permutation trinomials with Niho exponents, by constructing some new fractional polynomials that permute the set of the (q + 1)-th roots of unity in Fq2 , we present several classes of permutat...

متن کامل

A Recursive Construction of Permutation Polynomials over $\mathbb{F}_{q^2}$ with Odd Characteristic from R\'{e}dei Functions

In this paper, we construct two classes of permutation polynomials over Fq2 with odd characteristic from rational Rédei functions. A complete characterization of their compositional inverses is also given. These permutation polynomials can be generated recursively. As a consequence, we can generate recursively permutation polynomials with arbitrary number of terms. More importantly, the conditi...

متن کامل

New Permutation Trinomials Constructed from Fractional Polynomials

Permutation trinomials over finite fields consititute an active research due to their simple algebraic form, additional extraordinary properties and their wide applications in many areas of science and engineering. In the present paper, six new classes of permutation trinomials over finite fields of even characteristic are constructed from six fractional polynomials. Further, three classes of p...

متن کامل

Permutation polynomials on F_q induced from bijective Redei functions on subgroups of the multiplicative group of F_q

We construct classes of permutation polynomials over FQ2 by exhibiting classes of low-degree rational functions over FQ2 which induce bijections on the set of (Q + 1)-th roots of unity. As a consequence, we prove two conjectures about permutation trinomials from a recent paper by Tu, Zeng, Hu and Li.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016